1

Stonehenge: Outcome of All First Moves and PSPACE-Completeness

Takenaga, Yasuhiko, Mori, Hikari, Iwata, Shigeki
Journal:
ICGA Journal
Year:
2010
Language:
english
File:
PDF, 106 KB
english, 2010
2

Tetravex is NP-complete

Yasuhiko Takenaga, Toby Walsh
Journal:
Information Processing Letters
Year:
2006
Language:
english
File:
PDF, 70 KB
english, 2006
3

PSPACE-completeness of an escape problem

Yasuhiko Takenaga, Shigeru Arai
Journal:
Information Processing Letters
Year:
2008
Language:
english
File:
PDF, 145 KB
english, 2008
4

Hardness of identifying the minimum ordered binary decision diagram

Yasuhiko Takenaga, Shuzo Yajima
Journal:
Discrete Applied Mathematics
Year:
2000
Language:
english
File:
PDF, 104 KB
english, 2000
5

Tree-shellability of Boolean functions

Yasuhiko Takenaga, Kouji Nakajima, Shuzo Yajima
Journal:
Theoretical Computer Science
Year:
2001
Language:
english
File:
PDF, 156 KB
english, 2001
7

NP-Completeness of Pandemic

Nakai, Kenichiro, Takenaga, Yasuhiko
Journal:
Journal of Information Processing
Year:
2012
Language:
english
File:
PDF, 347 KB
english, 2012
8

Number of Three-point Tilings with Triangle Tiles

Takenaga, Yasuhiko, Tanaka, Narutoshi, Habara, Takahiro
Journal:
Journal of Information Processing
Year:
2015
Language:
english
File:
PDF, 391 KB
english, 2015
9

Strategies for Single-Player PuyoPuyo

Takenaga, Yasuhiko, Shimada, Yo
Journal:
ICGA Journal
Year:
2016
Language:
english
File:
PDF, 350 KB
english, 2016
10

QUIXO is EXPTIME-complete

Mishiba, Shohei, Takenaga, Yasuhiko
Journal:
Information Processing Letters
Year:
2020
File:
PDF, 245 KB
2020